package main.bytedance.FS;

/**
 * @author kejl
 * @version test
 * @date 2020/5/28 18:06
 */
public class Digui {
    public static void main(String[] args) {
     int b =    new Digui().test(new int[]{11,22,33,44,44,55},4);
     System.out.println(b);
    }

    public int test(int[] com,int i){
        if (i==0){
            return com[i];
        }
        int a = test(com,i-1);//递归返回的是前一个的返回值就是a+1, 就是上一级的a+1，依次所以得出15
        return a+1 ;

    }
}
